Gödel Machines: Fully Self-referential Optimal Universal Self-improvers
نویسنده
چکیده
We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers. Inspired by Kurt Gödel’s celebrated self-referential formulas (1931), such a problem solver rewrites any part of its own code as soon as it has found a proof that the rewrite is useful, where the problem-dependent utility function and the hardware and the entire initial code are described by axioms encoded in an initial proof searcher which is also part of the initial code. The searcher systematically and efficiently tests computable proof techniques (programs whose outputs are proofs) until it finds a provably useful, computable self-rewrite. We show that such a self-rewrite is globally optimal—no local maxima!—since the code first had to prove that it is not useful to continue the proof search for alternative self-rewrites. Unlike previous non-self-referential methods based on hardwired proof searchers, ours not only boasts an optimal order of complexity but can optimally reduce any slowdowns hidden by the O()-notation, provided the utility of such speed-ups is provable at all.
منابع مشابه
Gödel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements
متن کامل
Gödel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements
A Gödel machine is designed to solve arbitrary computational problems, such as maximizing the expected future reward of a robot in a possibly stochastic and reactive environment. Its initial software includes an axiomatic description of (1) the Gödel machine’s hardware, (2) known aspects of the environment, (3) goals and rewards to be achieved, (4) costs of actions and computations, (5) the ini...
متن کاملGödel Machines: Towards a Technical Justification of Consciousness
The growing literature on consciousness does not provide a formal demonstration of the usefulness of consciousness. Here we point out that the recently formulated Gödel machines may provide just such a technical justification. They are the first mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers, “conscious” or “self-aware” in the sense...
متن کاملGoedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements
We present the first class of mathematically rigorous, general, fully self-referential, selfimproving, optimally efficient problem solvers. Inspired by Kurt Gödel’s celebrated selfreferential formulas (1931), such a problem solver rewrites any part of its own code as soon as it has found a proof that the rewrite is useful, where the problem-dependent utility function and the hardware and the en...
متن کاملNovelty in complex adaptive systems (CAS) dynamics: a computational theory of actor innovation
This paper develops the formal foundations for the famous phase transition that physicists call ‘life at the edge of chaos’, the domain on which novelty or innovation emerges. For this the computational approach first introduced to game theory by Kenneth Binmore is used with players modelled as Turing Machines. The 1931 Gödel logic involving the Liar defines the pure logic of opposition. Only a...
متن کامل